We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.

Let R be a commutative ring with identity such that R admits at least two maximal ideals. In this article, we associate a graph with R whose vertex set is the set of all proper ideals I of R such that I is not contained in the Jacobson radical of R and distinct vertices I and J are joined by an edge if and only if I and J are not comparable under the inclusion relation. The aim of this article ...

Let R be a commutative ring and G(R) be a graph with vertices as proper andnon-trivial ideals of R. Two distinct vertices I and J are said to be adjacentif and only if I + J = R. In this paper we study a graph constructed froma subgraph G(R)Δ(R) of G(R) which consists of all ideals I of R such thatI Δ J(R), where J(R) denotes the Jacobson radical of R. In this paper westudy about the relation b...

let $r$ be a commutative ring with identity‎. ‎we use‎ ‎$varphi (r)$ to denote the comaximal ideal graph‎. ‎the vertices‎ ‎of $varphi (r)$ are proper ideals of r which are not contained‎ ‎in the jacobson radical of $r$‎, ‎and two vertices $i$ and $j$ are‎ ‎adjacent if and only if $i‎ + ‎j = r$‎. ‎in this paper we show some‎ ‎properties of this graph together with planarity of line graph‎ ‎assoc...

  ‎The rings considered in this article are commutative with identity which admit at least two maximal ideals‎.  ‎This article is inspired by the work done on the comaximal ideal graph of a commutative ring‎. ‎Let R be a ring‎.  ‎We associate an undirected graph to R denoted by mathcal{G}(R)‎,  ‎whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R)‎, ‎where J(R) is...

Let, of the domination number of graph. The bondage number G was first introduced by Fink, Jacobson, the minimum among all sets of holds. In this paper we show that for graph G satisfying